Deterministic Statistical Mapping of Sentences to Underspecified Semantics
نویسندگان
چکیده
We present a method for training a statistical model for mapping natural language sentences to semantic expressions. The semantics are expressions of an underspecified logical form that has properties making it particularly suitable for statistical mapping from text. An encoding of the semantic expressions into dependency trees with automatically generated labels allows application of existing methods for statistical dependency parsing to the mapping task (without the need for separate traditional dependency labels or parts of speech). The encoding also results in a natural per-word semantic-mapping accuracy measure. We report on the results of training and testing statistical models for mapping sentences of the Penn Treebank into the semantic expressions, for which per-word semantic mapping accuracy ranges between 79% and 86% depending on the experimental conditions. The particular choice of algorithms used also means that our trained mapping is deterministic (in the sense of deterministic parsing), paving the way for large-scale text-to-semantic mapping.
منابع مشابه
A Notion of Semantic Coherence for Underspecified Semantic Representation
The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability, in order to cover real natural language sentences with efficient algorithms. We address this trade-off ...
متن کاملEfficient Construction of Underspecified Semantics under Massive Ambiguity
We investigate the problem of determining a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntactic parse forest with associated constraintbased semantic construction rul...
متن کاملUnderspecified Beta Reduction
For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be -reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform -reduction on these descriptions. We show how to do this using -reduction constraints in the constraint language for -structures (CLLS).
متن کاملDescribing discourse semantics
Descriptions. In recent years, both formal and computational linguistics have been exploiting descriptions of structures where previously the structures themselves were used. The practice started with (Marcus et al., 1983), who demonstrated the value of (syntactic) tree descriptions for near-deterministic incremental parsing. Vijay-Shankar (Vijay-Shankar and Joshi, 1988; Vijay-Shankar, 1992) us...
متن کاملMinimal Recursion Semantics as Dominance Constraints: Graph-Theoretic Foundation and Application to Grammar Engineering
This thesis defines a translation fromMinimal Recursion Semantics into dominance constraints, two relevant and closely related scope underspecification formalisms. Due to fundamental differences in the way the two formalisms interpret underspecified descriptions, the translation is restricted to a large class of underspecified descriptions that share certain structural properties. On the one ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011